Barriers to Manipulation in Voting
نویسندگان
چکیده
Example 6.1 Consider an election with three alternatives, a, b, and c, and three voters, 1, 2, and 3. Suppose the rule used is plurality—an alternative gets a point each time it is ranked first by a voter, and the alternative with the most points wins—with ties broken towards alternatives earlier in the alphabet. Suppose voter 3 knows (or strongly suspects) that voter 1 will rank a first in her vote, and that voter 2 will rank b first. Voter 3’s true preferences are c b a. If she votes truthfully, this will result in a three-way tie, broken in favor of a which is 3’s least preferred alternative. If, instead, voter 3 ranks b first, then b will win instead. Hence, voter 3 has an incentive to cast a vote that does not reflect her true preferences.
منابع مشابه
Manipulation Under Voting Rule Uncertainty1
An important research topic in the field of computational social choice is the complexity of various forms of dishonest behavior, such as manipulation, control, and bribery. While much of the work on this topic assumes that the cheating party has full information about the election, recently there have been a number of attempts to gauge the complexity of non-truthful behavior under uncertainty ...
متن کاملManipulation under voting rule uncertainty
An important research topic in the field of computational social choice is the complexity of various forms of dishonest behavior, such as manipulation, control, and bribery. While much of the work on this topic assumes that the cheating party has full information about the election, recently there have been a number of attempts to gauge the complexity of non-truthful behavior under uncertainty ...
متن کاملComplexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules
We investigate manipulation of the Borda voting rule, as well as two elimination style voting rules, Nanson’s and Baldwin’s voting rules, which are based on Borda voting. We argue that these rules have a number of desirable computational properties. For unweighted Borda voting, we prove that it is NP-hard for a coalition of two manipulators to compute a manipulation. This resolves a long-standi...
متن کاملManipulation Can Be Hard in Tractable Voting Systems Even for Constant-Sized Coalitions
Voting theory has become increasingly integrated with computational social choice and multiagent systems. Computational complexity has been extensively used as a shield against manipulation of voting systems, however for several voting schemes this complexity may cause calculating the winner to be computationally difficult. Of the many voting systems that have been studied with regard to electi...
متن کاملSequential Voting and Agenda Manipulation: The Case of Forward Looking Tie-Breaking
We study the possibilities for agenda manipulation under strategic voting for two prominent sequential voting procedures, the amendment and the successive procedure. We show that a well-known result for tournaments, namely that the successive procedure is (weakly) more manipulable than the amendment procedure at any given preference profile, extends to arbitrary majority quotas. Moreover, our c...
متن کاملSequential voting and agenda manipulation
We study the possibilities for agenda manipulation under strategic voting for two prominent sequential voting procedures: the amendment procedure and the successive procedure. We show that a well known result for tournaments, namely that the successive procedure is (weakly) more manipulable than the amendment procedure at any given preference profile, extends to arbitrary majority quotas. Moreo...
متن کامل